package day45;

// 乒乓球框
// B中的球在A中都有，并且数量不超过

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main1 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextLine()) {
            String str = in.nextLine();
            String[] box = str.split(" ");
            if(box[0].length() >= box[1].length()) {
                Map<Character,Integer> mapA = new HashMap<>();
                for (int i = 0; i < box[0].length(); i++) {
                    char ch = box[0].charAt(i);
                    if(mapA.get(ch) == null) {
                        mapA.put(ch,1);
                    } else {
                        int num = mapA.get(ch);
                        mapA.put(ch,num+1);
                    }
                }
                int i = 0;
                for (; i < box[1].length(); i++) {
                    char ch = box[1].charAt(i);
                    if (mapA.containsKey(ch)) {
                        // 包含就进行减
                        int num = mapA.get(ch);
                        mapA.put(ch,num-1);
                        if(mapA.get(ch) < 0) {
                            // 说明数量大于
                            System.out.println("No");
                            break;
                        }
                    } else {
                        // 直接是不包含
                        System.out.println("No");
                        break;
                    }
                }
                // 注意这里条件不可以遗漏！
                if(i == box[1].length()) {
                    System.out.println("Yes");
                }
            } else {
                System.out.println("No");
            }
        }
    }
}
